Finding Multiple Optimal Solutions to Optimal Load Distribution Problem in Hydropower Plant
نویسندگان
چکیده
منابع مشابه
Finding Optimal Solutions to Atomix
We present solutions of benchmark instances to the solitaire computer game Atomix found with different heuristic search methods. The problem is PSPACE-complete. An implementation of the heuristic algorithm A* is presented that needs no priority queue, thereby having very low memory overhead. The limited memory algorithm IDA* is handicapped by the fact that, due to move transpositions, duplicate...
متن کاملFinding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first practical, admissible, and complete algorithm for solving problems of this kind. First, we propose a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms...
متن کاملFinding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
Pattern databases have been successfully applied to several problems. Their use assumes that the goal state is known, and once the pattern database is built, commonly it can be used by all instances. However, in Sokoban, before solving the puzzle, the goal position of each stone is unknown. Moreover, each Sokoban instance has its own state space search. In this paper we apply pattern databases ...
متن کامل*rough draft* Finding Optimal Solutions to the Multi-Agent Pathfinding Problem Using Heuristic Search
In the multi-agent pathfinding problem, multiple agents must cooperate to plan non-interfering paths that bring each agent from its current state to its goal state. We present the first practical and admissible algorithm for the multi-agent pathfinding problem. First, we introduce a general technique called operator decomposition, which can be used to reduce the branching factors of many combin...
متن کاملFinding Optimal Solutions to Rubik's Cube Using Pattern Databases
We have found the first optimal solutions to random instances of Rubik’s Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterative-deepening-A* (IDA*), with a lowerbound heuristic function based on large memory-based lookup tables, or “pattern databases” (Culberson and Schaeffer 1996). These tables store the exact number of moves required to solve various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2012
ISSN: 1996-1073
DOI: 10.3390/en5051413